Accepting Array Grammars with Control Mechanisms
نویسندگان
چکیده
We consider (n-dimensional) array grammars in the accepting mode with various control mechanisms and compare these families of array grammars with the corresponding families obtained by array grammars in the generating mode.
منابع مشابه
Accepting Grammars and Systems
We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited Lindenmayer systems and scattered context grammars) as accepting devices, in contrast with the usual generating mode. In some cases, accepting mode turns out to be j...
متن کاملGraph-Controlled Grammars as Language Acceptors
In this paper, we study the concept of accepting grammars within various forms of regulated grammars like programmed grammars, matrix (set) grammars, grammars with regular (set) control, periodically time-variant grammars as variants of grammars controlled by bi-coloured digraphs. We focus on their descriptive capacity. In this way, we continue our studies of accepting grammars 1, 2, 3, 11, 13,...
متن کاملAccepting Grammars and Systems: An Overview
We investigate several kinds of regulated rewriting (matrix, ordered, programmed, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited Lindenmayer systems and scattered context grammars) as accepting devices, in contrast with the usual generating mode. In a lot of cases, accepting mode turns out to be exactly as powerful...
متن کاملAccepting Pure Grammars and Systems
We consider several types of pure grammars and systems as language acceptors and compare them to their generating counterparts. In contrast with the case (considered in earlier papers of the authors) encountered when admitting nonterminals in these classical string rewriting mechanisms , we get incomparability results between language families generated and accepted by numerous types of pure gr...
متن کاملContextual Array Grammars with Matrix and Regular Control
We investigate the computational power of d-dimensional contextual array grammars with matrix control and regular control languages. For d ≥ 2, d-dimensional contextual array grammars are less powerful than matrix contextual array grammars, which themselves are less powerful than contextual array grammars with regular control languages. Yet in the 1-dimensional case, for a one-letter alphabet, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997